Real-time Depth Boundary Optimization for Local Area-based Stereo
نویسندگان
چکیده
We present a real-time method for detecting and removing boundary overextension, which is the fattening of foreground objects often observed in area-based stereo. Global methods such as graph-cuts are much slower than local methods, thus boundary overextension is still a major problem for realtime stereo. Starting with the depth discontinuity curves, the boundaries of the overextension regions are found using a snake-like energy optimized with a dynamic programming method. This clean-up step requires only O(#pixels) time and space, making it well-suited for real-time where local area-based stereo is often used. Our method can process a 512 × 384 depthmap in just 62 ms (16.1 Hz). Success is demonstrated on laboratory test datasets as well as a 3D reconstruction from video application.
منابع مشابه
Efficient edge-awareness propagation via single-map filtering for edge-preserving stereo matching
In this paper, we propose an efficient framework for edge-preserving stereo matching. Local methods for stereo matching are more suitable than global methods for real-time applications. Moreover, we can obtain accurate depth maps by using edge-preserving filter for the cost aggregation process in local stereo matching. The computational cost is high, since we must perform the filter for every n...
متن کاملEfficient Edge-Awareness Propagation via Single-Map Filtering
In this paper, we propose an efficient framework for edge-preserving stereo matching. Local methods for stereo matching are more suitable than global methods for real-time applications. Moreover, we can obtain accurate depth maps by using edge-preserving filter for the cost aggregation process in local stereo matching. The computational cost is high, since we must perform the filter for every n...
متن کاملStereoscopic depth estimation for online vision systems
The human visual perception heavily depends on stereoscopic vision. By fusing the two views that our eyes provide, a 3-D sensation of the surrounding is generated. It is therefore natural to assume that machine vision systems also benefit from a comparable sense. A lot of work has been done in the area of machine stereo vision, but a severe drawback of today’s algorithms is that they either ach...
متن کاملFast Dense Stereo Matching Using Adaptive Window in Hierarchical Framework
A new area-based stereo matching in hierarchical framework is proposed. Local methods generally measure the similarity between the image pixels using local support window. An appropriate support window, where the pixels have similar disparity, should be selected adaptively for each pixel. Our algorithm consists of the following two steps. In the first step, given an estimated initial disparity ...
متن کاملReconfigurable Computing Architecture for Accurate Disparity Map Calculation in Real-Time Stereo Vision
This paper presents a novel hardware architecture using FPGA-based reconfigurable computing (RC) for accurate calculation of dense disparity maps in real-time, stereo-vision systems. Recent stereo-vision hardware solutions have proposed local-area approaches. Although parallelism can be easily exploited using local methods by replicating the window-based image elaborations, accuracy is limited ...
متن کامل